全文获取类型
收费全文 | 277篇 |
免费 | 39篇 |
国内免费 | 35篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2021年 | 10篇 |
2020年 | 10篇 |
2019年 | 9篇 |
2018年 | 11篇 |
2017年 | 21篇 |
2016年 | 21篇 |
2015年 | 12篇 |
2014年 | 30篇 |
2013年 | 36篇 |
2012年 | 21篇 |
2011年 | 21篇 |
2010年 | 15篇 |
2009年 | 29篇 |
2008年 | 14篇 |
2007年 | 12篇 |
2006年 | 19篇 |
2005年 | 14篇 |
2004年 | 9篇 |
2003年 | 4篇 |
2002年 | 3篇 |
2001年 | 5篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 3篇 |
排序方式: 共有351条查询结果,搜索用时 109 毫秒
131.
复杂适应系统理论为我们研究军事系统提供了崭新的视角,避免了传统的基于还原论方法研究军事系统机械分隔忽略系统要素之间相互作用的问题,可以得到军事系统全面准确的认识,对于深入研究一体化联合作战的本质内涵、基本特征和主要方法,尽快形成一体化联合作战的理论体系具有重要意义。文章通过分析军事系统特点得出军事系统是复杂适应系统的结论,在此基础上,从复杂适应系统理论的角度分析了一体化联合作战的内涵及提高军事系统一体化联合作战能力需要重点解决的四个问题。 相似文献
132.
文章研究联合作战军民融合问题,提出不断深化联合作战军民融合思想意识,构建完善联合作战军民融合体制机制,加强联合作战军民融合的平时准备。 相似文献
133.
文中主要对一体化联合作战中的精确控制内涵进行了阐述,然后分别从重要性和实现途径两个方面对作战时序的精确控制、作战空间的精确控制、作战目标的精确控制和作战信息环境的精确控制进行探讨。 相似文献
134.
一维弹道修正弹阻力环修正控制算法研究 总被引:5,自引:1,他引:4
根据一维弹道修正弹阻力环修正技术的特点,建立了一维弹道修正弹的弹道模型.在此基础上分析了利用阻力环进行一维弹道修正的能力以及阻力环张开时刻与射程修正量之间的关系.提出了阻力环张开时刻的算法.仿真结果表明,该算法具有较强的修正能力,选择合适的阻力环张开时刻,可以使弹丸的落点偏差大大减小. 相似文献
135.
We consider a discrete time‐and‐space route‐optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically moving targets. This article formulates a novel convex mixed‐integer nonlinear program for this problem that generalizes earlier models to situations with multiple targets, searcher deconfliction, and target‐ and location‐dependent search effectiveness. We present two solution approaches, one based on the cutting‐plane method and the other on linearization. These approaches result in the first practical exact algorithms for solving this important problem, which arises broadly in military, rescue, law enforcement, and border patrol operations. The cutting‐plane approach solves many realistically sized problem instances in a few minutes, while existing branch‐and‐bound algorithms fail. A specialized cut improves solution time by 50[percnt] in difficult problem instances. The approach based on linearization, which is applicable in important special cases, may further reduce solution time with one or two orders of magnitude. The solution time for the cutting‐plane approach tends to remain constant as the number of searchers grows. In part, then, we overcome the difficulty that earlier solution methods have with many searchers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
136.
137.
In some industries such as automotive, production costs are largely fixed and therefore maximizing revenue is the main objective. Manufacturers use promotions directed to the end customers and/or retailers in their distribution channels to increase sales and market share. We study a game theoretical model to examine the impact of “retailer incentive” and “customer rebate” promotions on the manufacturer's pricing and the retailer's ordering/sales decisions. The main tradeoff is that customer rebates are given to every customer, while the use of retailer incentives is controlled by the retailer. We consider several models with different demand characteristics and information asymmetry between the manufacturer and a price discriminating retailer, and we determine which promotion would benefit the manufacturer under which market conditions. When demand is deterministic, we find that retailer incentives increase the manufacturer's profits (and sales) while customer rebates do not unless they lead to market expansion. When the uncertainty in demand (“market potential”) is high, a customer rebate can be more profitable than the retailer incentive for the manufacturer. With numerical examples, we provide additional insights on the profit gains by the right choice of promotion.© 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
138.
科技创新能力是体现高校综合办学实力的核心指标。以科研团队为视角对高校科技创新能力的评价问题进行了研究,分析了高校团队科技创新能力的要素构成、结构特征,在此基础上从人员队伍、条件基础、文化环境、科技投入、科技产出5个方面出发定义了一个可扩展的团队科技创新能力评价指标模型;提出了基于多属性决策的科技创新能力评价方法,为科研团队绩效管理提供了方法支撑。 相似文献
139.
This article investigates the method of allocating arriving vessels to the terminals in transshipment hubs. The terminal allocation decision faced by a shipping alliance has the influence on the scheduled arrival time of vessels and further affects the bunker consumption cost for the vessels. A model is formulated to minimize the bunker consumption cost as well as the transportation cost of inter‐terminal transshipment flows/movements. The capacity limitation of the port resources such as quay cranes (QCs) and berths is taken into account. Besides the terminal allocation, the QC assignment decision is also incorporated in the proposed model. A local branching based method and a particle swarm optimization based method are developed to solve the model in large‐scale problem instances. Numerical experiments are also conducted to validate the effectiveness of the proposed model, which can save around 14% of the cost when compared with the “First Come First Served” decision rule. Moreover, the proposed solution methods not only solve the proposed model within a reasonable computation time, but also obtain near‐optimal results with about 0.1~0.7% relative gap. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 529–548, 2016 相似文献
140.
We review the operations research/management science literature on data-driven methods in retail operations. This line of work has grown rapidly in recent years, thanks to the availability of high-quality data, improvements in computing hardware, and parallel developments in machine learning methodologies. We survey state-of-the-art studies in three core aspects of retail operations—assortment optimization, order fulfillment, and inventory management. We then conclude the paper by pointing out some interesting future research possibilities for our community. 相似文献